Unstructured Point Cloud Surface Denoising and Decimation Using Distance RBF K-Nearest Neighbor Kernel
نویسندگان
چکیده
In this work unstructured point clouds, resulting from 3D range acquisition are point wise-processed, using a proposed kd-tree nearest neighbor method, based in a generative data driven, local radial basis function’s (RBF) support:φ(S, pi(xi, yi, zi)), for the point set S : {pi}i I , using surface statistic and a Gaussian convolution kernel, point sets are smoothed according to local surface features. As a minor contribution we also present a point cloud semi-rigid grid decimation method, based on a similar framework, using multi-core hardware, experiment results achieve comparable quality results with existing and more complex methods; time performance and results are presented for comparison.
منابع مشابه
Detection of some Tree Species from Terrestrial Laser Scanner Point Cloud Data Using Support-vector Machine and Nearest Neighborhood Algorithms
acquisition field reference data using conventional methods due to limited and time-consuming data from a single tree in recent years, to generate reference data for forest studies using terrestrial laser scanner data, aerial laser scanner data, radar and Optics has become commonplace, and complete, accurate 3D data from a single tree or reference trees can be recorded. The detection and identi...
متن کاملAsymptotic Behaviors of Nearest Neighbor Kernel Density Estimator in Left-truncated Data
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
متن کاملLearning Anisotropic RBF Kernels
We present an approach for learning an anisotropic RBF kernel in a game theoretical setting where the value of the game is the degree of separation between positive and negative training examples. The method extends a previously proposed method (KOMD) to perform feature re-weighting and distance metric learning in a kernel-based classification setting. Experiments on several benchmark datasets ...
متن کاملProximity Graphs for Defining Surfaces over Point Clouds
a b c d Visualization of the moving least squares surface (magenta) over a 2D point cloud (black dots) based on different distance functions: (a,c) Euclidean, (b,d) ours based on proximity graphs. We present a new definition of an implicit surface over a noisy point cloud. It can be evaluated very fast, but, unlike other definitions based on the moving least squares approach, it does not suffer...
متن کاملK-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Nearest Neighbor (KNN) algorithms often perform more poorly than SVMs on classification tasks. We then propose modified K-Nearest Neighbor algorithms to overcome the perceived problem. The approach is similar in spirit to Ta...
متن کامل